The continuous p-centre problem: An investigation into variable neighbourhood search with memory
نویسندگان
چکیده
منابع مشابه
The continuous p-centre problem: An investigation into variable neighbourhood search with memory
A VNS-based heuristic using both a facility as well as a customer type neighbourhood structure is proposed to solve the p-centre problem in the continuous space. Simple but effective enhancements to the original Elzinga-Hearn algorithm as well as a powerful ‘locate-allocate’ local search used within VNS are proposed. In addition, efficient implementations in both neighbourhood structures are pr...
متن کاملAn Investigation of Variable Neighbourhood Search for University Course Timetabling
The university course timetabling problem consists, in essence, of assigning lectures to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule. In this paper, we present a variable neighbourhood search approach with an exponential monte carlo acceptance criteria. This heuristic search approach is based on random-descent ...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملParallel Variable Neighbourhood Search for the p-Median
† Département d’informatique et recherche opérationnelle and Centre de recherche sur les transports, Université de Montréal Email: {hoeb, michelg}@crt.umontreal.ca ‡ GERAD and École des Hautes Etudes Commerciales 3000 ch. de la Côte-Sainte-Catherine, Montréal H3T 1V6, Canada Email: {pierreh, nenad}@crt.umontreal.ca § Matematički Institut, SANU Knez Mihajlova 35, Beograd, Yugoslavia Email: nenad...
متن کاملA Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
The Cutwidth Minimization Problem, also known as the Minimum Cut Linear Arrangement consists of finding an arrangement of the vertices of a graph on a line, in such a way that the maximum number of edges between each pair of consecutive vertices is minimized. This problem has practical applications in VLSI Design, Network Migration and Graph Drawing, among others. In this paper we propose sever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2015
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.10.006